Complexity classes

Results: 1120



#Item
361Jacobs School of Engineering / Healthcare science / Complexity classes / NP / Rady School of Management

FA14_All_Apps_Admits_New_Total.xlsx

Add to Reading List

Source URL: grad.ucsd.edu

Language: English - Date: 2014-11-12 14:15:00
362Complexity classes / Textbook / P

Microsoft Word - 6A_std_tg

Add to Reading List

Source URL: singaporemathematics.com

Language: English - Date: 2014-12-11 13:44:59
363Approximation algorithms / Cluster analysis / Combinatorial optimization / NP-complete problems / Complexity classes / Correlation clustering / Consensus clustering / Optimization problem / Minimum k-cut / Theoretical computer science / Computational complexity theory / Statistics

A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
364Operations research / Complexity classes / Probabilistic complexity theory / Job shop scheduling / Mathematical optimization / Monte Carlo method / Algorithm / NP / SL / Theoretical computer science / Applied mathematics / Computational complexity theory

Job Shop Scheduling with Probabilistic Durations1 J. Christopher Beck and Nic Wilson2 Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule.

Add to Reading List

Source URL: tidel.mie.utoronto.ca

Language: English - Date: 2006-01-18 12:07:28
365Sorting algorithms / Analysis of algorithms / Complexity classes / Models of computation / Circuit complexity / Quicksort / NC / Time complexity / Merge sort / Theoretical computer science / Computational complexity theory / Mathematics

Parallelism in Sequential Guy Blelloch

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2011-04-26 13:42:59
366Complexity classes / Analysis of algorithms / Mathematical optimization / Time complexity / Algorithm / P / NP-complete / P versus NP problem / Quantum algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics

COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:08
367Complexity classes / Abstraction / Complex systems theory / Complexity / Holism / Transdisciplinarity / Language / Reduction / Rosetta Project / Theoretical computer science / Science / Applied mathematics

Rosetta Stone Linguistic Problems Bozhidar Bozhanov Ivan Derzhanski Problem Committee Problem Committee

Add to Reading List

Source URL: aclweb.org

Language: English - Date: 2013-07-25 09:32:21
368Complexity classes / Community websites / Mathematical optimization / Conjectures / P versus NP problem / Structural complexity theory / Stack Exchange Network / NP-complete / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2010-11-05 18:41:12
369Mathematical logic / Logic programming / Rules of inference / Logic in computer science / Complexity classes / Unit propagation / Resolution / Clause / NL / Theoretical computer science / Mathematics / Automated theorem proving

Effective Preprocessing with Hyper-Resolution and Equality Reduction Fahiem Bacchus1 and Jonathan Winter1 Department of Computer Science, University Of Toronto,? Toronto, Ontario, Canada [fbacchus|winter]@cs.toronto.edu

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2003-06-07 02:16:30
370Mathematical optimization / Operations research / Complexity classes / Structural complexity theory / Job shop scheduling / NP / Algorithm / Time complexity / Approximation algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

SOP TRANSACTIONS ON APPLIED MATHEMATICS Accepted version, see http://www.scipublish.com/journals/AM/papers/1097 for published version. Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel

Add to Reading List

Source URL: drpage.pagewizardgames.com

Language: English - Date: 2015-02-07 18:05:03
UPDATE